Solving Nonconvex Problems of Multibody Dynamics with Joints, Contact and Small Friction by Successive Convex Relaxation
نویسندگان
چکیده
Time-stepping methods using impulse-velocity approaches are guaranteed to have a solution for any friction coefficient, but they may have nonconvex solution sets. We present an example of a configuration with a nonconvex solution set for any nonzero value of the friction coefficient. We construct an iterative algorithm that solves convex subproblems and that is guaranteed, for sufficiently small friction coefficients, to retrieve, at a linear convergence rate, the velocity solution of the nonconvex linear complementarity problem whenever the frictionless configuration can be disassembled. In addition, we show that one step of the iterative algorithm provides an excellent approximation to the velocity solution of the original, possibly nonconvex, problem if the product between the friction coefficient and the slip velocity is small.
منابع مشابه
A fixed-point iteration approach for multibody dynamics with contact and small friction
Acceleration–force setups for multi-rigid-body dynamics are known to be inconsistent for some configurations and sufficiently large friction coefficients (a Painleve paradox). This difficulty is circumvented by time-stepping methods using impulse-velocity approaches, which solve complementarity problems with possibly nonconvex solution sets. We show that very simple configurations involving two...
متن کاملA domain decomposition algorithm for contact problems with Coulomb’s friction
Contact problems of elasticity are used in many fields of science and engineering, especially in structural mechanics, geology and biomecanics. Many numerical procedures solving contact problems have been proposed in the engineering literature. They are based on standard discretization techniques for partial differential equations in combination with a special implementation of non-linear conta...
متن کاملTowards Implementations of Successive Convex Relaxation Methods for Nonconvex Quadratic Optimization Problems
Recently Kojima and Tun cel proposed new successive convex relaxation methods and their localized-discretized variants for general nonconvex quadratic optimization problems. Although an upper bound of the optimal objective function value within a previously given precision can be found theoretically by solving a nite number of linear programs, several important implementation issues remain unso...
متن کاملNonconvex Optimization for Communication Systems
Convex optimization has provided both a powerful tool and an intriguing mentality to the analysis and design of communication systems over the last few years. A main challenge today is on nonconvex problems in these application. This paper presents an overview of some of the important nonconvex optimization problems in point-to-point and networked communication systems. Three typical applicatio...
متن کاملNonlinear Dynamics and Control of Crank-Slider Mechanism with Multiple Clearance Joints
In the current study, behavior of crank-slider mechanism with single and multiple clearance joints are analyzed. Using Lankarani-Nikravesh theory for estimating discontinuous contact forces in clearance joints, relevant systems have been mathematically modeled. Through numerical simulations, perturbations in response of mechanisms with clearance joints have been analyzed. Effects of increasing ...
متن کامل